A Reconstruction of Veriication Techniques by Abstract Interpretation
نویسندگان
چکیده
منابع مشابه
Temporal Logic Veriication of Lotos Speciications Using Abstract Interpretation
In 6, 5] a technique for the automatic derivation of an Abstract Interpretation Domain for (the Abstract Data Types part) of LOTOS speciications has been proposed. In this paper we present an abstract model of process semantics, Abstract Trace Semantics, which is built on top of the above mentioned Abstract Interpretation Domain and which we use as a model for an abstract interpretation of a li...
متن کاملJava Bytecode Veriication Using Model Checking ?
We provide an abstract interpretation for Java bytecode in order to build nite state models of bytecode programs. The bytecode constraints for assuring safety are formulated in terms of temporal logic formulae. These formulae are checked against the nite program models by a (standard) model checker. By doing so we see a practical way to perform bytecode veriication on a formal basis. This could...
متن کاملAutomatic Veriication of Parameterized Networks of Processes by Abstraction
In this paper we are interested in the veriication of safety properties of parameterized networks. A network is deened as a parallel composition of an arbitrary but nite number of identical sequential processes, where we consider parallel composition by interleaving and synchronization by shared variables. Using abstraction techniques, a process, called an abstract network, encoding the behavio...
متن کاملVerification of Linear Hybrid Systems by Means of Convex Approximations
We present a new application of the abstract interpretation by means of convex polyhedra, to a class of hybrid systems, i.e., systems involving both discrete and continuous variables. The result is an eecient automatic tool for approximate, but conservative, veriication of reachability properties of these systems.
متن کاملHardware-Veri cation using First Order BDDsy
Binary decision diagrams (BDDs) are a well known method for representing and comparing boolean functions. Although BDDs are known to be very compact, in all known approaches for hardware veriication, BDD-based calculi are restricted to propositional logic. This logic is insuucient for the veriication of abstract data types, time abstraction and also for hierarchical veriication. In this paper, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997